Optimizing insuring critical path problem under uncertainty based on GP-BPSO algorithm
نویسندگان
چکیده
منابع مشابه
A new probability model for insuring critical path problem with heuristic algorithm
In order to obtain an adequate description of risk aversion for insuring critical path problem, this paper develops a new class of two-stage minimum risk problems. The first-stage objective function is to minimize the probability of total costs exceeding a predetermined threshold value, while the secondstage objective function is to maximize the insured task durations. For general task duration...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملOptimization of Insuring Critical Path Problem with Uncertain Activity Duration Times
In fuzzy decision systems, we model insuring critical path problem by two-stage risk-aversion fuzzy programming. For the proposed two-stage insuring critical path problem, we first define three solution concepts, expected value solution, wait-and-see solution and here-and-now solution, then introduce the value of perfect information of value-at-risk (VaRVPI) and the value of the fuzzy solution ...
متن کاملOptimizing decentralized production–distribution planning problem in a multi-period supply chain network under uncertainty
Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final produc...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientia Iranica
سال: 2017
ISSN: 2345-3605
DOI: 10.24200/sci.2017.4587